A Probabilistic Primality test Based on the Properties of Certain Generalized Lucas Numbers
نویسندگان
چکیده
After defining a class of generalized Fibonacci numbers and Lucas numbers, we characterize the Fibonacci pseudoprimes of the mth kind. In virtue of the apparent paucity of the composite numbers which are Fibonacci pseudoprimes of the mth kind for distinct values o f the integral parameter m , a method, which we believe to be new, for finding large probable primes is proposed. An efficient computational algorithm is outlined.
منابع مشابه
On the Properties of Balancing and Lucas-Balancing $p$-Numbers
The main goal of this paper is to develop a new generalization of balancing and Lucas-balancing sequences namely balancing and Lucas-balancing $p$-numbers and derive several identities related to them. Some combinatorial forms of these numbers are also presented.
متن کاملPrimality Tests Using Algebraic Groups
The first deterministic polynomial-time algorithm for primality testing by Agrawal, Kayal, and Saxena [Agrawal et al. 02] has been epoch-making. On the other hand, some previously known primality (or pseudoprimality) tests are still of interest not only because they are faster practically but also because they offer interesting mathematical objects such as pseudoprimes. The aim of this paper is...
متن کاملGaussian Mersenne and Eisenstein Mersenne primes
The Biquadratic Reciprocity Law is used to produce a deterministic primality test for Gaussian Mersenne norms which is analogous to the Lucas–Lehmer test for Mersenne numbers. It is shown that the proposed test could not have been obtained from the Quadratic Reciprocity Law and Proth’s Theorem. Other properties of Gaussian Mersenne norms that contribute to the search for large primes are given....
متن کاملNew Primality Criteria and Factorizations of 2 TM d = 1
A collection of theorems is developed for testing a given integer N for primality. The first type of theorem considered is based on the converse of Fermât 's theorem and uses factors of N — 1. The second type is based on divisibility properties of Lucas sequences and uses factors of N + 1. The third type uses factors of both N — 1 and N + 1 and provides a more effective, yet more complicated, p...
متن کاملAn Õ(log2(N)) time primality test for generalized Cullen numbers
Generalized Cullen Numbers are positive integers of the form Cb(n) := nb n + 1. In this work we generalize some known divisibility properties of Cullen Numbers and present two primality tests for this family of integers. The first test is based in the following property of primes from this family: nb n ≡ (−1)b (mod nbn +1). It is stronger and has less computational cost than Fermat’s test (to b...
متن کامل